| 翻訳と辞書 |
| Diamond v. Diehr ： ウィキペディア英語版 |
Diamond v. Diehr
''Diamond v. Diehr'', , was a United States Supreme Court decision which held that controlling the execution of a physical process, by running a computer program did not preclude patentability of the invention as a whole. The high court reiterated its earlier holdings that mathematical formulas in the abstract could not be patented, but it held that the mere presence of a software element did not make an otherwise patent-eligible machine or process patent ineligible. ''Diehr'' was the third member of a trilogy of Supreme Court decisions on the patent-eligibility of computer software related inventions.〔The other two cases were ''Gottschalk v. Benson'', 409 U.S. 63 (1972), and ''Parker v. Flook'', 437 U.S. 584 (1978). The Supreme Court's most recent decisions on patent eligibility of software-related inventions are ''Bilski v. Kappos'' and ''Alice v. CLS Bank'', both of which are cases concerning business methods.〕
== Background ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Diamond v. Diehr」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|